Methods and systems for defending against cyber-attacks

ABSTRACT

Methods, systems, and computer-readable storage medium including a computer program product for defending against cyber-attacks are provided. One method includes receiving, by a processor, program code and automatically generating a chronomorphic binary for the program code. The method further includes storing the chronomorphic binary in an executable memory space and diversifying the executable memory space for the chronomorphic binary during runtime of the program code. A system includes memory configured for storing a defense module and a processor connected to the memory. The processor, when executing the defense module, is configured for performing the above-referenced method. One computer program product includes computer code for performing the above-referenced method.

CROSS-REFERENCE TO RELATED APPLICATION

This application is a continuation of and claims priority to U.S. patent application Ser. No. 14/987,375, filed Jan. 4, 2016, which is incorporated herein by reference.

STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT

This invention was made with government support under contract number FA8750-14-C-0093 awarded by the Defense Advanced Research Projects Agency and Air Force Research Laboratory. The government has certain rights in the invention.

BACKGROUND OF THE INVENTION

Years ago, cyber attackers only needed to find a buffer overflow or other vulnerability and use it to upload their exploitable instructions, then make the program execute those new instructions. To counter this broad vulnerability, modern operating systems enforce “write XOR execute” (WX) defenses. That is, memory is marked as either writable or executable, but not both. So exploit code that is uploaded to writable memory cannot be executed. Not surprisingly, attackers then developed a more sophisticated exploitation method.

Computer instruction sets are densely packed into a small number of bits, so accessing those bits in ways that a programmer did not originally intend can yield gadgets (i.e., groups of bits that form valid program instructions that can be strung together by an attacker to execute arbitrary attack code from an otherwise harmless program). Known as Return Oriented Programming (ROP), these types of cyber exploits have been effective and commonplace since the widespread deployment of WX defenses. Software with a single small buffer-overflow vulnerability can be hijacked into performing arbitrary computations using ROP techniques. Hackers have even developed ROP compilers that build the ROP exploits automatically by finding gadgets in the binary of a vulnerable target and stringing those gadgets together to implement the attacker's code. To counteract various software diversity defenses that try to move the gadgets around so that a previously-compiled ROP attack will fail, attackers have developed Blind ROP (BROP) attacks that perform automated reconnaissance to find the gadgets in a running program.

Various defense methods have been developed to try to foil code reuse exploits such as ROP and BROP. Some of defenses instruct binaries to change their execution semantics or automatically filter program input to prevent exploits. However, these approaches require process-level virtual machines or active monitoring by other processes, which incur a comparatively high overhead. Other approaches separate and protect exploitable data (e.g., using shadow stacks), but such approaches also incur comparatively high overhead.

To reduce overhead and to maintain compatibility with existing operating systems and software architectures, many researchers have focused on lightweight, diversity-based techniques to prevent code reuse exploits. For example, Address Space Layout Randomization (ASLR) is common in modern operating systems.

ASLR techniques function by loading program modules into different locations each time the software is started. However, ASLR does not randomize the location of the instructions within modules that have been previously loaded, so these programs are still vulnerable to ROP attacks.

Some diversity techniques modify the binaries themselves to make them less predictable by an attacker. For example: 1) compile-time diversity produces semantically equivalent binaries with different structures; 2) offline code randomization transforms a binary on disk into a functionally equivalent variant with different bytes loaded into memory; and 3) load-time code randomization makes the binary load blocks of instructions at randomized addresses. These diversity-based approaches incur comparatively lower overhead than other ROP defenses and they offer statistical guarantees against ROP attacks. Unfortunately, these compile-time, offline, and load-time diversity defenses are still susceptible to BROP attacks that perform runtime reconnaissance to map the binary and find gadgets. So even with compile-time, offline, or load-time diversity, programs that run for a significant period of time without being reloaded (e.g., all modern server architectures) are vulnerable.

Other ROP defenses modify the operating system to augment diversity. While these approaches provide promising results, they do not modify existing third-party programs to work on existing operating systems.

Another recent approach uses compile-time diversity in tandem with hardware-based enforcement mechanism that prevents adversaries from reading any code. This approach protects against memory disclosure and thereby prevents ROP and BROP attacks; however, like the above techniques, this approach requires modifying the underlying operating system or hardware.

Some runtime techniques clone executable elements in memory and toggle between them during runtime so that the attacker is unaware of which memory layout is currently executing; however, the diversity factor is not as high as the above approaches. Another recent approach combines execution-time switching with runtime diversification by instrumenting all call, return, and jump instructions. On these instrumented instructions, execution may randomly switch between executable copies while the other copy is diversified by fine-grained ASLR. While this approach prevents varieties of ROP attacks, it incurs significant runtime overhead due to a dynamic binary instrumentation framework, and it doubles the size of the binary due to executable memory cloning. Still other approaches automatically instrument the binary, but they consume a high amount of disk space, memory footprint, and/or performance overhead.

SUMMARY

Various embodiments provide methods, systems, and computer-readable storage medium including a computer program product for defending against cyber-attacks are provided. One method comprises receiving, by a processor, program code and automatically generating a chronomorphic binary (e.g., a binary the changes throughout execution time) for the program code. The method further includes storing the chronomorphic binary in an executable memory space and diversifying the executable memory space for the chronomorphic binary during runtime of the program code.

A system comprises memory configured for storing a defense module and a processor connected to the memory. The processor, when executing the defense module, is configured for receiving program code and automatically generating a chronomorphic binary for the program code. The processor is further configured for storing the chronomorphic binary in an executable memory space and diversifying the executable memory space for the chronomorphic binary during runtime of the program code.

One computer program product for defending against cyber-attacks comprises computer code for receiving, by a processor, program code and computer code for automatically generating a chronomorphic binary for the program code. The computer program product further comprises computer code for storing the chronomorphic binary in an executable memory space and computer code for diversifying the executable memory space for the chronomorphic binary during runtime of the program code.

BRIEF DESCRIPTION OF THE DRAWINGS

In order that the advantages of the invention will be readily understood, a more particular description of the invention briefly described above will be rendered by reference to specific embodiments that are illustrated in the appended drawings. Understanding that these drawings depict only typical embodiments of the invention and are not therefore to be considered to be limiting of its scope, the invention will be described and explained with additional specificity and detail through the use of the accompanying drawings, in which:

FIG. 1 illustrates an exemplary attempt of a classic stack-overflow-based ROP exploit on a chronomorphic executable;

FIG. 2 is a block diagram of one embodiment of a system for defending against cyber-attacks;

FIG. 3 is a block diagram illustrating an embodiment of converting a target program in a chronomorphic binary;

FIG. 4 is a diagram illustrating one embodiment of the chronomorphic binary of FIG. 3 interacting with a morph table;

FIG. 5 is one example of a portion of a control flow graph automatically generated by an offline analysis tool; and

FIG. 6 is a flow diagram illustrating one embodiment of a method for defending against cyber-attacks.

DETAILED DESCRIPTION

Unlike the diversity-based protection techniques described above, the chronomorphic program code of the present disclosure utilizes a single instance of the program in memory at any time, making the code more suitable for embedded or real-time systems. The chronomorphic programs disclosed herein diversify themselves throughout program execution to statistically prevent code reuse attacks (e.g., ROP and BROP attacks), even if the attacker knows the memory layout. The runtime costs incurred by the disclosed chronomorphic techniques occurs when actually morphing the program; however, when not morphing the program, the program, for the most part, executes its original instructions. Furthermore, the costs of the morphing behavior can be adjusted and controlled to achieve desired performance levels in the face of changing threat levels, rates of adversary-provided input, and the like. Unlike other approaches, the disclosed chronomorphic programs can run on existing hardware and operating systems, making them suitable for legacy systems.

Furthermore, the chronomorphic programs disclosed herein foil cyber-attacks, including code reuse attacks that rely on the consistency of a program's memory layout since the memory layout changes during execution of the program. As described below, these memory changes should, but do not necessarily, occur early in the processing of each user transaction.

With reference now to FIG. 1, FIG. 1 illustrates an exemplary attempt of a classic stack-overflow-based ROP exploit on a chronomorphic executable. The attacker overflows a stack buffer 110 in a stack memory 100 to overwrite the return address 120 with one or more addresses 130 including the gadgets 140 (i.e., groups of bits that form valid program instructions that can be strung together by an attacker to execute arbitrary attack code from an otherwise harmless program or exploitable executable memory) that the attacker may have learned by analyzing the executable on disk or by exploiting runtime information leaks. The chronomorphic program (e.g., a program that changes throughout execution time) rewrites itself regularly throughout execution so the attacker's knowledge of the program is outdated. When the program returns to the addresses 130 written by the attacker, the program executes different instructions than those intended by the attacker because the addresses 130 no longer include the gadgets 140 since the gadgets 140 have been moved to addresses 150. The program promptly crashes without executing the exploit. The gray area (i.e., block relocation space) could be comprised of invalid, unexploitable instructions that quickly cause a crash, or alternatively, nop-slides (e.g., an instruction that includes the explicit purpose of not changing the state of any of the registers, status flags, or memory that are accessible by the programmer) into an invocation of alarms or forensic analysis functions that terminate with an error signal, consistent with other software “booby trapping” approaches.

The chronomorph approach described herein changes the machine code at runtime using a self-modifying code (SMC) technique. Using the SMC technique, the chronomorphic preserves the functionality of the underlying program (i.e., maintains the program semantics), maximizes diversity over time, and minimize performance costs. The SMC technique functions by changing the permissions of the target program's memory (i.e., temporarily circumvents the WX defense) to modify the program code layout and then resumes execution of the program code.

With reference now to FIG. 2, FIG. 2 is a block diagram of one embodiment of a system 200 for defending against a cyber-attack. At least in the illustrated embodiment, system 200 comprises a user interface (UI) 210, a memory 220 storing a defense tool 2210, and a processor 230 coupled to and in communication with each other via a bus 240 (e.g., a wired and/or wireless bus).

In various embodiments, UI 210 may be any type of user interface known in the art or developed in the future. That is, UI 210 may be any type of communication system and/or device that enables a user (human and/or mechanical) to introduce program code from a third-party to system 200.

Memory 220 may be any type of computer memory known in the art or developed in the future. That is, memory 220 may be any computer-readable medium capable of storing program instructions comprising defense tool 2210.

In one embodiment, defense tool 2210 comprises an offline analysis tool 2215 and an online execution tool 2220 that, in combination, construct one or more chronomorphic binaries from normal third-party programs. Offline analysis tool 2215 comprises computer-executable code for:

1) Transforming the executable to inject a chronomorph SMC runtime that invokes memory permissions (e.g., “mprotect” in Linux® and “VirtualProtect” in Windows®) and rewriting portions of the binary during execution, which produces a SMC binary (block 315 in FIG. 3) with SMC functions that are disconnected from the program's normal control flow (see block 305 in FIG. 4);

2) Analyzing the SMC binary to identify potentially exploitable sequences of instructions (e.g., gadgets) (see block 320 in FIG. 3);

3) Identifying relocatable gadgets and transform the SMC binary to make those gadgets relocatable (see block 330 in FIG. 3);

4) Computing instruction-level, semantics-preserving transforms that make non-relocatable gadgets and surrounding program code of no use to attackers (see blocks 342 and 344 in FIG. 3);

5) Writing the relocations and transforms to a morph table outside the chronomorphic binary (block 350 in FIG. 3); and

6) Injecting morph triggers (e.g., an invocation of the self-modifying code module to diversify executable memory in accordance with the morph table) into the SMC binary so that the program will morph itself periodically (see block 360 in FIG. 3), which produces the chronomorphic binary (block 370 in FIG. 3).

In one various embodiments, before offline analysis tool 2215 can analyze the binary and compute transformations for the third-party program (e.g., a target program), offline analysis tool 2215 injects a chronomorph SMC runtime into the target program. The chronomorph SMC includes functions for modifying memory protection (e.g., mprotect), writing byte sequences to specified addresses, and reading the morph table from outside the binary. These chronomorph functions may themselves include gadgets and have runtime diversification potential, so the SMC-capable binary that includes these functions should be the subject of all further offline analysis.

In one embodiment when the source code of the target program is available, the chronomorph SMC runtime is injected by linking the source code of the target program against the compiled chronomorph SMC runtime. The result of linking the source code of the target program against the compiled chronomorph SMC runtime is a dynamically-linked SMC executable or a statically-linked SMC executable.

In an embodiment when the source code of the target program is unavailable, the chronomorph SMC runtime is injected by rewriting a statically-linked binary by extending the binary with a new loadable, executable segment containing the statically-linked chronomorph SMC runtime. The result of rewriting the statically-linked binary is a statically-linked SMC executable.

In another embodiment in which the source code of the target program is unavailable, the chronomorph SMC runtime is injected by rewriting a dynamically-linked binary by adding chronomorph procedures to an alternative procedure linkage table and adding objects to a global object table. The binary is then extended with a new loadable, executable segment containing the dynamically-linked chronomorph SMC runtime to produce a dynamically-linked SMC executable.

Each of these three embodiments inject the chronomorph SMC runtime into the target program to produce a SMC binary. With the SMC binary created, offline portion 2215 analyzes the target program for potentially exploitable sequences of instructions or gadgets.

Offline analysis tool 2215, in one embodiment, comprises a third-party ROP compiler that automatically identifies available gadgets within a given binary and creates an exploit of the user's choice (e.g., execute an arbitrary shell command) by compiling a sequence of attack gadgets from the available gadgets, if possible. During operation, offline analysis tool 2215 runs the ROP compiler against the SMC binary to find gadgets that span the entire executable segment, including the chronomorph SMC runtime.

The ROP compiler results are used to prioritize the diversification efforts to allocate time and computing resources proportional to the various exploitation threats within the binary as follows:

1) Attack gadgets (e.g., gadgets that can be chained together to form an attack sequence) are given the highest priority. The chronomorphic binary addresses attack gadgets with the highest-diversity transforms;

2) Available gadgets (e.g., gadgets found by the ROP compiler, but are not present in an attack sequence) are given medium priority. The chronomorphic binary addresses available gadgets with the highest-diversity transforms, but within acceptable performance bounds; and

3) Instructions that have not been linked to an available gadget are given the lowest priority, but are still diversified when feasible. Since zero-day gadgets and new code-reuse attack strategies may arise after transformation time, this diversification offers additional security.

Offline analysis tool 2215 performs all possible transformations of potentially dangerous gadgets. In one embodiment, offline analysis tool 2215 saves costlier transformations (e.g., dynamic block relocations) for the high-risk attack gadgets. That is, in this embodiment the costlier transformations are not performed on non-attack gadgets (i.e., available gadgets and instructions that may become potentially dangerous).

The ROP compiler may be any ROP compiler known in the art or developed in the future capable of compiling attack gadgets and reporting all available gadgets. In one embodiment, offline analysis tool 2215 utilizes a portfolio approach running a variety of ROP compilers and merging their lists of dangerous gadgets to identify attack gadgets, available gadgets, and instructions that may become potentially dangerous.

After the dangerous and/or potentially dangerous gadgets are identified, the gadgets can be diversified via relocation to thwart an attack. It may not be possible to remove a high-risk gadget entirely from the executable since its instructions may be integral to the program's execution. However, the chronomorphic binary can relocate the gadget with high frequency throughout execution as long as it preserves the control flow of the target program.

In one embodiment, automatic relocation of gadgets is the highest-diversity strategy that the chronomorphic binary offers. The chronomorphic binary allocates an empty block relocation space in the binary, reserved for gadget relocation. Whenever the chronomorphic binary triggers a morph (discussed below), the chronomorphic binary shuffles relocated blocks to random locations in the block relocation space and repairs previous control flow with recomputed jump instructions to the corresponding location in the block relocation space.

For each potentially dangerous relocatable gadget, the chronomorphic binary performs the following procedure to make the gadget relocatable during runtime:

1) Compute the basic block (i.e., a sequence of instructions with exactly one entry and exit point) that contains the gadget;

2) Relocate the byte sequence of the gadget's basic block to an empty area in the block relocation space;

3) Write a jump instruction from the head of the basic block to the new address in the block relocation space;

4) Write nop instructions (e.g., instructions that include the explicit purpose of not changing the state of any of the registers, status flags, or memory that are accessible by the programmer) over the remainder of the gadget's previous basic block, destroying the gadget; and

5) Write the block's byte sequence and the address of the new jump instruction to the morph table.

The morph table now contains enough information to place the gadget-laden block anywhere in the block relocation space and to re-compute the corresponding jump instruction accordingly.

Intuitively, diversity of the binary increases with the size of the block relocation space. For a single gadget block g of with byte-size and block relocation space of size |b|, relocating g adds V (g, b)=|b|−|g| additional program variants.

Relocate multiple gadget blocks G={g0, . . . , g_(|G|1)}, the following number of variants are added:

V(G,b)=Π_(i=0) ^(|G|−1)(|b|−Σ _(j=0) ^(i) |g _(j)|)

The probability of guessing all of the relocated gadgets' addresses is therefore 1/V (G, b), which diminishes quickly as the chosen size of the block relocation space increases. In one embodiment, the chronomorphic binary has the following constraints for choosing gadget blocks for relocation:

1) Relocated blocks should not contain a call instruction. When a call instruction is executed, the subsequent instruction's address is pushed onto the stack, and if the calling block is then relocated, execution would return into an arbitrary (incorrect) spot in the block relocation space;

2) Relocated blocks should be at least the size of the jump to the block relocation space, so that Chronomorph has room to write the jump;

3) Relocated blocks should end in an indirect control flow (e.g., ret) instruction; otherwise, we would have to re-compute the control flow instruction at the block's tail at every relocation. Empirically, the vast majority of these blocks end in ret;

4) Relocated gadgets should not span two blocks.

In various other embodiments, the chronomorphic binary uses in-place code randomization (IPCR) strategies to randomize non-relocated instructions. IPCR strategies perform narrow-scope transformations without changing the byte-length of instruction sequences.

A first IPC strategy to compute transformations comprises instruction substitution (IS), which substitutes a single instruction for one or more alternatives. For example, comparisons can be performed in either order, XORing a register with itself is equivalent to MOVing or ANDing zero. These instructions have the same execution semantics, but they change the byte content of the instruction so unintended control flow instructions (e.g., 0xC3=ret) are potentially transformed or eliminated. A single IS adds as many program variants as there are instruction alternatives.

Another IPCR strategy comprises register preservation code reordering (RPCR), which reorders the pop instructions before every “ret” instruction of a function and also reorders the corresponding push instructions at the function head to maintain symmetry. A register preservation code reordering for a single function adds as many variants as there are permutations of push or pop instructions.

In various embodiments, RPCR changes the layout of a function's stack frame, which may render it not continuable. For example, if the control flow enters the function and it preserves register values via PUSHing and then the chronomorphic binary runs RPCR on the function, the control flow will likely POP values into unintended registers and adversely affect program functionality.

Stack-frame diversity (e.g., RPCR) should, but not necessarily, be attempted at runtime if execution cannot continue or re-enter the function (e.g., from an internal call) after a SMC morph operation. In various embodiments, this is enforced analytically with control flow graph (CFG) analysis: if execution can continue within a function “f” from the morph trigger (i.e., if the morph trigger is reachable from f in the CFG), the stack frame of f should not be diversified. After the relocations and/or transformations are performed, the relocations and/or transformations are written to one or more morph tables located outside the chronomorphic binary.

In various embodiments, each morph table is a compact binary file that accompanies the chronomorphic binary (see FIG. 3). Each morph table binary represents packed structs (e.g., MorphPoint structs with internal MorphOption byte sequences). Each MorphPoint represents a decision point (i.e., an IS or RPCR opportunity) where any of the associated MorphOption structs will suffice. Each MorphPoint is stateless (e.g., does not depend on the last choice made for the MorphPoint) and independent of any other MorphPoint so that random choices are safe and ordering of the morph table is not important. The relocation data is a separate portion of the morph table and contains the content of relocatable blocks alongside their corresponding jump addresses. Similar to IPCR operations, relocations are stateless and independent, provided the chronomorph SMC runtime does not overlay them in the block relocation space. After the chronomorphic binary injects SMC capabilities into third-party executables and is capable of diversification, the chronomorphic binary uses triggers to know when to relocate and/or transform the target program code.

The chronomorphic binary, in one embodiment, automatically connects the chronomorph SMC runtime into the target program's control flow to induce diversification of executable memory during runtime. The injection of morph triggers presents a trade-off: morphing too frequently will unnecessarily degrade program performance, whereas morphing too seldom allows wide windows of attack. In one embodiment, morphing occurs at the speed of an input (e.g., once per server request or transaction or user input (or some modulo thereof)).

In various embodiments, the location of the morph trigger(s) in the target program's control flow determines morph frequency. For example, FIG. 4 shows a portion of a control flow graph for an exemplary target program, calling out the getc( ) input function. In FIG. 4, the shaded regions are functions, instruction listings are basic blocks, and edges are control flow edges. As shown in FIG. 4, the chronomorphic binary injects calls to the SMC runtime at the input points or at calling functions with stack-based buffers (which are more likely to contain vulnerabilities through which a ROP attack would begin). In addition, the chronomorphic binary may also include an interface for the application developer to add a specialized MORPH comment in the source code, which is replaced by a morph trigger during the rewriting phase. After offline analysis tool 2215 completes the offline analysis, online execution tool 2220 performs the defense functions.

Online execution tool 2220 comprises computer-executable code for diversifying the executable memory space of the chronomorphic binary during program runtime. Diversification is accomplished by relocating and transforming the instructions of the program code without hindering the performance or functionality of the target program. In other words, the chronomorphic binary executes in the same manner as the original non-chronomorphic variant, except when the morph triggers are invoked. For example, when the first morph trigger is invoked, the chronomorph SMC runtime loads the morph table and seeds its random number generator. In one embodiment, the morph triggers induce a partial morphing (e.g., if performance suffers too much with a full morph). In other embodiments, the morph triggers induce a complete SMC diversification of the in-process executable memory according to the IPCR and relocation data in the morph table:

1) The block relocation space is made writable with mprotect;

2) Relocated basic blocks in the block relocation space are overwritten with nop instructions;

3) Each relocatable block is inserted to a random block relocation space address, and its jump instruction (where the block used to be in the target program's original CFG) is rewritten accordingly;

4) The block relocation space is made executable; and

5) Each MorphPoint is traversed and a corresponding MorphOption is chosen at random and written. Each operation is surrounded by mprotect calls to make the corresponding page writable and then executable.

With reference again to FIG. 2, processor 230 may be any processing system and/or device known in the art or developed in the future. That is, processor 230 is any type of system and/or device capable of executing the instructions comprising defense tool 2210. In other words, processor 230, when executing the instructions comprising defense tool 2210, is configured for performing the functions of offline analysis tool 2215 and online execution tool 2220.

Referring now to FIG. 6, FIG. 6 is a flow diagram of one embodiment of a method 600 for defending against a cyber-attack. At least in the illustrated embodiment, method 600 begins offline by injecting a chronomorph SMC runtime into the binary of a target program binary to produce a SMC binary with SMC functions that are disconnected from the target program's normal control flow (block 605).

Method 600 further comprises analyzing the SMC binary to identify one or more gadgets (block 610). Relocatable gadgets are identified (block 615) and the SMC binary is transformed to make those gadgets relocatable (block 620).

Furthermore, method 600 includes computing instruction-level, semantics-preserving transforms that denature non-relocatable gadgets and the surrounding program code (block 625). The relocations and transforms are written to a morph table outside the chronomorphic binary (block 630) and morph triggers are injected into the SMC binary so that the program will morph itself periodically (block 635), which produces a chronomorphic binary.

During execution of the target program, method 600 comprises rewriting portions of the target program's binary to automatically relocate the gadgets (block 640). The portions of the target program's binary are rewritten such that block 640 is periodically, continually, or substantially continually repeated (arrow 645).

In summary, various embodiments provide methods, systems, and computer-readable storage medium including a computer program product for defending against cyber-attacks are provided. One method comprises receiving, by a processor, program code and automatically generating a chronomorphic binary for the program code. The method further includes storing the chronomorphic binary in an executable memory space and diversifying the executable memory space for the chronomorphic binary during runtime of the program code.

In one embodiment, automatically generating the chronomorphic binary comprises transforming the program code to generate a self-modifying code (SMC) binary, analyzing the SMC binary to identify one or more gadgets that may be relocated, transforming the SMC binary to enable the identified one or more gadgets to be relocatable, writing the one or more gadget relocations to a morph table located external to the chronomorphic binary, and injecting morph triggers into the SMC binary. In a further embodiment, automatically generating the chronomorphic binary further comprises computing instruction-level, semantics-preserving transforms to denature non-relocatable gadgets and surrounding program code and writing the transforms to the morph table that is located external to the chronomorphic binary. Diversifying the executable memory space, in an embodiment, comprises relocating and transforming instructions in the program code during runtime.

In another exemplary embodiment, transforming the program code to generate the SMC binary comprises injecting one or more memory protection functions in the SMC binary and the method further comprises connecting the memory protection functions to a control flow of the program code when the morph triggers are invoked. Injecting the one or more memory protection functions, in one embodiment, comprises linking a source code of the program code and a first chronomorph SMC runtime code to generate a SMC executable module, generating statically-linked SMC executable code by rewriting a statically-linked binary by adding a first segment including a statically-linked chronomorph SMC runtime, and/or generating dynamically-linked SMC executable code. The dynamically-linked SMC executable code is generated by rewriting a dynamically-linked binary via adding chronomorph procedures to to an alternative table, adding objects to a global object table, and extending the dynamically-linked binary with a second segment including a dynamically-linked chronomorph SMC runtime. In one embodiment, injecting the one or more memory protection functions comprises linking a source code of the program code and a first chronomorph SMC runtime code to generate a SMC executable module to generate one of statically-linked SMC executable code and dynamically-linked SMC executable code.

A system comprises memory configured for storing a defense module and a processor connected to the memory. The processor, when executing the defense module, is configured for receiving program code and automatically generating a chronomorphic binary for the program code. The processor is further configured for storing the chronomorphic binary in an executable memory space and diversifying the executable memory space for the chronomorphic binary during runtime of the program code.

In one embodiment, the processor, when automatically generating the chronomorphic binary, is configured for transforming the program code to generate a self-modifying code (SMC) binary, analyzing the SMC binary to identify one or more gadgets that may be relocated, transforming the SMC binary to enable the identified one or more gadgets to be relocatable, writing the one or more gadget relocations to a morph table located external to the chronomorphic binary, and injecting morph triggers into the SMC binary. In a further embodiment, the processor, when automatically generating the chronomorphic binary, is further configured for computing instruction-level, semantics-preserving transforms to denature non-relocatable gadgets and surrounding program code and writing the transforms to the morph table that is located external to the chronomorphic binary. When diversifying the executable memory space, in an embodiment, the processor is configured for relocating and transforming instructions in the program code during runtime.

In another exemplary embodiment, the processor, when transforming the program code to generate the SMC binary, is configured for injecting one or more memory protection functions in the SMC binary and the processor is further configured for connecting the memory protection functions to a control flow of the program code when the morph triggers are invoked. When injecting the one or more memory protection functions, in one embodiment, the processor is configured for linking a source code of the program code and a first chronomorph SMC runtime code to generate a SMC executable module, generating statically-linked SMC executable code by rewriting a statically-linked binary by adding a first segment including a statically-linked chronomorph SMC runtime, and/or generating dynamically-linked SMC executable code. The dynamically-linked SMC executable code is generated by the processor by rewriting a dynamically-linked binary via adding chronomorph procedures to to an alternative table, adding objects to a global object table, and extending the dynamically-linked binary with a second segment including a dynamically-linked chronomorph SMC runtime. In one embodiment, when injecting the one or more memory protection functions, the processor is configured for linking the source code of the program code and the first chronomorph SMC runtime code to generate a SMC executable module and to generate one of statically-linked SMC executable code and dynamically-linked SMC executable code.

One computer program product for defending against cyber-attacks comprises computer code for receiving, by a processor, program code and computer code for automatically generating a chronomorphic binary for the program code. The computer program product further comprises computer code for storing the chronomorphic binary in an executable memory space and computer code for diversifying the executable memory space for the chronomorphic binary during runtime of the program code.

In one embodiment, the computer code for automatically generating the chronomorphic binary comprises computer code for transforming the program code to generate a self-modifying code (SMC) binary, computer code for analyzing the SMC binary to identify one or more gadgets that may be relocated, computer code for transforming the SMC binary to enable the identified one or more gadgets to be relocatable, computer code for writing the the one or more gadget relocations to a morph table located external to the chronomorphic binary, and computer code for injecting morph triggers into the SMC binary. In a further embodiment, the computer code for automatically generating the chronomorphic binary further comprises computer code for computing instruction-level, semantics-preserving transforms to denature non-relocatable gadgets and computer code for surrounding program code and computer code for writing the transforms to the morph table that is located external to the chronomorphic binary. The computer code for diversifying the executable memory space, in an embodiment, comprises computer code for relocating and transforming instructions in the program code during runtime.

In another exemplary embodiment, the computer code for transforming the program code to generate the SMC binary comprises computer code for injecting one or more memory protection functions in the SMC binary and the computer-readable storage medium further comprises computer code for connecting the disconnected memory protection functions to a control flow of the program code when the morph triggers are invoked. The computer code for injecting the one or more memory protection functions, in one embodiment, comprises computer code for linking a source code of the program code and a first chronomorph SMC runtime code to generate a SMC executable module, computer code for generating statically-linked SMC executable code by rewriting a statically-linked binary by adding a first segment including a statically-linked chronomorph SMC runtime, and/or generating dynamically-linked SMC executable code. The dynamically-linked SMC executable code is generated by computer code for rewriting a dynamically-linked binary via adding chronomorph procedures to to an alternative table, computer code for adding objects to a global object table, and computer code for extending the dynamically-linked binary with a second segment including a dynamically-linked chronomorph SMC runtime. In one embodiment, the computer code for injecting the one or more memory protection functions comprises computer code for linking a source code of the program code and a first chronomorph SMC runtime code to generate a SMC executable module to generate one of statically-linked SMC executable code and dynamically-linked SMC executable code.

As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method or computer program product. Accordingly, aspects of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module” or “system.” Furthermore, aspects of the present invention may take the form of a computer program product embodied in one or more computer readable medium(s) having computer readable program code embodied thereon.

Any combination of one or more computer-readable medium(s) may be utilized. The computer-readable medium may be a computer-readable signal medium or a computer-readable storage medium such as, for example, non-transitory computer-readable signal medium or a non-transitory computer-readable storage medium. A computer-readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer-readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer-readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.

Program code embodied on a computer-readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wired, optical fiber cable, infrared, etc., or any suitable combination of the foregoing. Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object-oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made through an external computer (for example, through the Internet using an Internet Service Provider).

The flowcharts and/or block diagrams in the above figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowcharts and block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

Although the invention has been described with respect to particular embodiments, such embodiments are for illustrative purposes only and should not be considered to limit the invention. Various alternatives and changes will be apparent to those of ordinary skill in the art upon reading this application. 

1-20. (canceled)
 21. A method for defending against cyber-attacks, comprising: receiving, by a processor, a program's code; automatically generating a chronomorphic binary for the program's code comprising: transforming the program's code to generate a self-modifying code (SMC) binary, analyzing the SMC binary to identify one or more gadgets to be relocated, transforming the SMC binary to enable the identified one or more gadgets to be relocatable, and injecting morph triggers into the SMC binary; storing the chronomorphic binary in an executable memory space; and diversifying the executable memory space for the chronomorphic binary during runtime of the program's code, comprising relocating and transforming instructions in the program's code repeatedly during runtime, throughout execution of the program's code.
 22. The method of claim 21, wherein diversifying the executable memory space is performed repeatedly during a single runtime of the program's code.
 23. The method of claim 22, wherein automatically generating the chronomorphic binary for the program's code comprises writing the one or more gadget relocations to a morph table located external to the chronomorphic binary.
 24. The method of claim 21, wherein diversifying the executable memory space is performed repeatedly during a single runtime of the program's code.
 25. The method of claim 21, wherein automatically generating the chronomorphic binary further comprises: computing instruction-level, semantics-preserving transforms to denature non-relocatable gadgets and surrounding program's code; and writing the transforms to the morph table that is located external to the chronomorphic binary.
 26. The method of claim 25, wherein diversifying the executable memory space comprises relocating and transforming instructions in the program's code during runtime.
 27. The method of claim 21, wherein: transforming the program's code to generate the SMC binary comprises injecting one or more disconnected memory protection functions into the SMC binary; and the method further comprises connecting the memory protection functions to a control flow of the program's code when the morph triggers are invoked.
 28. The method of claim 27, wherein injecting the one or more disconnected memory protection functions comprises one of: linking a source code of the program's code and a first chronomorph SMC runtime code to generate a SMC executable module; generating statically-linked SMC executable code by rewriting a statically-linked binary by adding a first segment including a statically-linked chronomorph SMC runtime; and generating dynamically-linked SMC executable code by rewriting a dynamically-linked binary by: adding chronomorph procedures to an alternative table, adding objects to a global object table, and extending the dynamically-linked binary with a second segment including a dynamically-linked chronomorph SMC runtime.
 29. The method of claim 28, wherein injecting the one or more disconnected memory protection functions comprises linking the source code of the program's code and the first chronomorph SMC runtime code to generate the SMC executable module and to generate one of the statically-linked SMC executable code and the dynamically-linked SMC executable code.
 30. A system for defending against cyber-attacks, comprising: memory configured for storing a defense module; and a processor coupled to the memory, wherein the processor, when executing the defense module, is configured for: receiving a program's code, automatically generating a chronomorphic binary for the program's code including: transforming the program's code to generate a self-modifying code (SMC) binary, analyzing the SMC binary to identify one or more gadgets that may be relocated, and transforming the SMC binary to enable the identified one or more gadgets to be relocatable, and storing the chronomorphic binary in an executable memory space, and diversifying the executable memory space for the chronomorphic binary during runtime of the program's code including relocating and transforming instructions in the program's code repeatedly during runtime, throughout execution of the program's code.
 31. The system of claim 30, wherein the processor, when executing the defense module is configured for performing diversifying the executable memory space for the chronomorphic binary repeatedly during a single runtime of the program's code including repeatedly relocating and transforming instructions in the program's code during the single runtime.
 32. The system of claim 31, wherein the processor being configured for automatically generating a chronomorphic binary for the program's code includes the processor being configured for writing the one or more gadget relocations to a morph table located external to the chronomorphic binary.
 33. The system of claim 32, wherein the processor, when automatically generating the chronomorphic binary, is further configured for: computing instruction-level, semantics-preserving transforms to denature non-relocatable gadgets and surrounding program's code; and writing the transforms to the morph table that is located external to the chronomorphic binary.
 34. The system of claim 33, wherein the processor, when diversifying the executable memory space, is configured for relocating and transforming instructions in the program's code during runtime.
 35. The system of claim 30, wherein: the processor, when transforming the program's code to generate the SMC binary, is configured for injecting one or more disconnected memory protection functions in the SMC binary; and the processor is further configured for connecting the disconnected memory protection functions to a control flow of the program's code when the morph triggers are invoked.
 36. The system of claim 35, wherein the processor, when injecting the one or more disconnected memory protection functions, is configured for performing one of: linking a source code of the program's code and a first chronomorph SMC runtime code to generate a SMC executable module; generating statically-linked SMC executable code by rewriting a statically-linked binary by adding a first segment including a statically-linked chronomorph SMC runtime; and generating dynamically-linked SMC executable code by rewriting a dynamically-linked binary by: adding chronomorph procedures to an alternative table, adding objects to a global object table, and extending the dynamically-linked binary with a second segment including a dynamically-linked chronomorph SMC runtime.
 37. The system of claim 36, wherein the processor, when injecting the one or more disconnected memory protection functions, is configured for linking the source code of the program's code and the first chronomorph SMC runtime code to generate the SMC executable module and to generate one of statically-linked SMC executable code and dynamically-linked SMC executable code.
 38. A non-transitory computer-readable storage medium including a computer program product for defending against cyber-attacks, comprising: computer code for receiving, by a processor, a program's code; computer code for automatically generating a chronomorphic binary for the program's code comprising: computer code for transforming the program's code to generate a self-modifying code (SMC) binary, computer code for analyzing the SMC binary to identify one or more gadgets that may be relocated, computer code for transforming the SMC binary to enable the identified one or more gadgets to be relocatable, and computer code for injecting morph triggers into the SMC binary, and computer code for storing the chronomorphic binary in an executable memory space; and computer code for diversifying the executable memory space for the chronomorphic binary during a runtime of the program's code including relocating and transforming instructions in the program's code repeatedly during runtime, throughout execution of the program's code.
 39. The computer-readable storage medium of claim 38, further comprising: computer code for identifying a first morph trigger and, in response to identifying the first morph trigger directing the processor to the computer code for diversifying the executable memory space for the chronomorphic binary, causing the diversifying of the executable memory space for the chronomorphic binary for a first time during the runtime of the program's code; computer code for identifying a second morph trigger and, in response to identifying the second morph trigger directing the processor to the computer code for diversifying the executable memory space for the chronomorphic binary, causing the diversifying of the executable memory space for the chronomorphic binary for a second time during the runtime of the program's code.
 40. The computer-readable storage medium of claim 38, wherein the computer code for automatically generating a chronomorphic binary for the program's code comprises computer code for writing the one or more gadget relocations to a morph table located external to the chronomorphic binary. 